An Automata Theory Dedicated towards
نویسنده
چکیده
We present a theory for automata in HOL, which is dedicated towards formal hardware synthesis. The theory contains deenitions for formally representing and transforming automata. In this approach hardware is represented by automata descriptions and formal synthesis is performed by applying formally proven theorems. The approach presented is constructive | i.e. starting from speciications at higher levels of abstractions, synthesis can be performed by repeated applications of these transformations. Specialized reenements and optimizations at the RT and gate levels are discussed.
منابع مشابه
Automata | a Theory Dedicated towards Formal Circuit Synthesis
This is a technical report about a theory named Automata. Automata is an arithmetic for synchronous circuits. It provides means for representing and transforming circuit descriptions at the RT level and gate level in a mathemtical manner. Automata has been implemented in the HOL theorem proving environment. Preproven theorems are designed for performing standard synthesis steps such as state en...
متن کاملPossibilities, Limitations and Problems in Retiming | a View from a Logical Perspective
This paper gives a formal description of retiming and analyzes its possibilities. The paper is based on a theory for automata in HOL, which is dedicated towards formal hardware representation and transformations. In this approach hardware is represented by automata descriptions and formal synthesis is performed by applying formally proven theorems.
متن کاملFUZZY PREORDERED SET, FUZZY TOPOLOGY AND FUZZY AUTOMATON BASED ON GENERALIZED RESIDUATED LATTICE
This work is towards the study of the relationship between fuzzy preordered sets and Alexandrov (left/right) fuzzy topologies based on generalized residuated lattices here the fuzzy sets are equipped with generalized residuated lattice in which the commutative property doesn't hold. Further, the obtained results are used in the study of fuzzy automata theory.
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملCellular Automata Simulation of a Bistable Reaction-Diffusion System: Microscopic and Macroscopic Approaches
The Cellular Automata method has been used to simulate the pattern formation of the Schlögl model as a bistable Reaction-Diffusion System. Both microscopic and macroscopic Cellular Automata approaches have been considered and two different methods for obtaining the probabilities in the microscopic approach have been mentioned. The results show the tendency of the system towards the more sta...
متن کامل